Edge-choosability of multicircuits
نویسنده
چکیده
A multicircuit is a multigraph whose underlying simple graph is a circuit (a connected 2-regular graph). The List-Colouring Conjecture (LCC) is that every multigraph G has edgechoosability (list chromatic index) ch’(G) equal to its chromatic index x’(G). In this paper the LCC is proved first for multicircuits, and then, building on results of Peterson and Woodall, for any multigraph G in which every block is bipartite or a multicircuit or has at most four vertices or has underlying simple graph of the form KI,,,,. @ 1999 Elsevier Science B.V. All rights reserved
منابع مشابه
Total choosability of multicircuits II
A multicircuit is a multigraph whose underlying simple graph is a circuit (a connected 2-regular graph). In this paper, the method of Alon and Tarsi is used to prove that all multicircuits of even order, and some regular and near-regular multicircuits of odd order have total choosability (i.e., list total chromatic number) equal to their ordinary total chromatic number. This completes the proof...
متن کاملTotal choosability of multicircuits I
A multicircuit is a multigraph whose underlying simple graph is a circuit (a connected 2-regular graph). In this pair of papers, it is proved that every multicircuit C has total choosability (i.e., list total chromatic number) ch00(C ) equal to its ordinary total chromatic number 00(C ). In the present paper, the kernel method is used to prove this for every multicircuit that
متن کاملChoosability conjectures and multicircuits
This paper starts with a discussion of several old and new conjectures about choosability in graphs. In particular, the list-colouring conjecture, that ch′ = ′ for every multigraph, is shown to imply that if a line graph is (a : b)-choosable, then it is (ta : tb)-choosable for every positive integer t. It is proved that ch(H )= (H ) for many “small” graphs H , including in9ations of all circuit...
متن کاملChoosability and edge choosability of planar graphs without five cycles
It is proved that a planar graph G without five cycles is three degenerate, hence, four choosable, and it is also edge-(A( G) + l)h c oosable. @ 2002 Elsevier Science Ltd. All rights reserved. Keywords-Choosability, Edge choosability, Degeneracy, Planar graph.
متن کاملEdge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
Let G be a planar graph with no two 3-cycles sharing an edge. We show that if ∆(G) ≥ 9, then χ′l(G) = ∆(G) and χ ′′ l (G) = ∆(G) + 1. We also show that if ∆(G) ≥ 6, then χ ′ l(G) ≤ ∆(G) + 1 and if ∆(G) ≥ 7, then χ′′ l (G) ≤ ∆(G) + 2. All of these results extend to graphs in the projective plane and when ∆(G) ≥ 7 the results also extend to graphs in the torus and Klein bottle. This second edge-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 202 شماره
صفحات -
تاریخ انتشار 1999